Birthday attack to discrete logarithm
نویسنده
چکیده
The discrete logarithm in a finite group of large order has been widely applied in public key cryptosystem. In this paper, we will present a probabilistic algorithm for discrete logarithm.
منابع مشابه
A simple method for precisely determining complexity of many Birthday attacks
We show a simple and yet very precise upper bound on self-intersection time of a Markov chain, i.e. the expected number of steps until some state has been visited twice. When applied to certain birthday attacks the bound matches even the lead coefficient in simulation data to over 4 significant digits. This precision makes it possible to explain the differing performance between attacks that ar...
متن کاملA New Non-MDS Hash Function Resisting Birthday Attack and Meet-in-the-middle Attack
To examine the integrity and authenticity of an IP address efficiently and economically, this paper proposes a new non-Merkle-Damgård structural (non-MDS) hash function called JUNA that is based on a multivariate permutation problem and an anomalous subset product problem to which no subexponential time solutions are found so far. JUNA includes an initialization algorithm and a compression algo...
متن کاملA Lightweight Hash Function Resisting Birthday Attack and Meet-in-the-middle Attack
To examine the integrity and authenticity of an IP address efficiently and economically, this paper proposes a new non-Merkle-Damgård structural (non-MDS) hash function called JUNA that is based on a multivariate permutation problem and an anomalous subset product problem to which no subexponential time solutions are found so far. JUNA includes an initialization algorithm and a compression algo...
متن کاملCollision bounds for the additive Pollard rho algorithm for solving discrete logarithms
We prove collision bounds for the Pollard rho algorithm to solve the discrete logarithm problem in a general cyclic group G. Unlike the setting studied by Kim et al., we consider additive walks: the setting used in practice to solve the elliptic curve discrete logarithm problem. Our bounds differ from the birthday bound O. p jGj/ by a factor of p log jGj and are based on mixing time estimates f...
متن کاملToward a secure public-key blockwise fragile authentication watermarking
In this paper, we describe some weaknesses of public-key blockwise fragile authentication watermarkings and the means to make them secure. Wong’s original algorithm as well as a number of its variant techniques are not secure against a mere block cut-and-paste or the well-known birthday attack. To make them secure, some schemes have been proposed to make the signature of each block depend on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0712.1400 شماره
صفحات -
تاریخ انتشار 2007